<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/tag/network%20Information"><title>BibSonomy bookmarks for /tag/network%20Information</title><link>https://www.bibsonomy.org/tag/network%20Information</link><description>BibSonomy RSS Feed for /tag/network%20Information</description><items><rdf:Seq><rdf:li rdf:resource="http://networkcultures.org/wpmu/cpov/"/><rdf:li rdf:resource="http://www.campaigncentral.org.uk/"/><rdf:li rdf:resource="http://www.eyeonearth.eu/"/><rdf:li rdf:resource="http://www.visualcomplexity.com/vc/"/><rdf:li rdf:resource="http://radar.oreilly.com/2011/11/social-network-analysis.html"/><rdf:li rdf:resource="http://www.ecst.csuchico.edu/~beej/guide/net/html/"/><rdf:li rdf:resource="http://www.dslreports.com/"/><rdf:li rdf:resource="http://www.beepcore.org/"/><rdf:li rdf:resource="http://www.cs.wisc.edu/~cao/papers/summary-cache/share.html"/><rdf:li rdf:resource="http://www.cs.rice.edu/~scrosby/hash/CrosbyWallach_UsenixSec2003/index.html"/><rdf:li rdf:resource="http://www.site.uottawa.ca/~elsaddik/abedweb/applets/Applets/Sliding_Window/sliding_window.html"/><rdf:li rdf:resource="http://www.doxpara.com/"/><rdf:li rdf:resource="http://www.linuxvirtualserver.org/software/tcpsp/"/><rdf:li rdf:resource="http://www.omnifarious.org/~hopper/technical/tcp_splicing.html"/><rdf:li rdf:resource="http://www.openp2p.com/pub/a/p2p/2003/03/13/howard.html"/><rdf:li rdf:resource="http://www-136.ibm.com/developerworks/grid"/><rdf:li rdf:resource="http://www.igda.org/online/#papers"/><rdf:li rdf:resource="http://mute-net.sourceforge.net/"/><rdf:li rdf:resource="http://www.hal-pc.org/~johnnie2/winsock.html"/><rdf:li rdf:resource="http://www.repairfaq.org/filipg/LINK/F_crc_v3.html"/></rdf:Seq></items></channel><item rdf:about="http://networkcultures.org/wpmu/cpov/"><title>Wikipedia, Critical Point of View</title><description></description><link>http://networkcultures.org/wpmu/cpov/</link><dc:creator>thtbln</dc:creator><dc:date>2017-07-16T12:23:04+02:00</dc:date><dc:subject>wikipedia web2.0 conference network research newmedia sociology information socialnetworking </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2017-07-16T12:23:04+02:00&#034; href=&#034;http://networkcultures.org/wpmu/cpov/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://networkcultures.org/wpmu/cpov/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/wikipedia"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web2.0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/conference"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/research"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/newmedia"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/sociology"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/socialnetworking"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.campaigncentral.org.uk/"><title>Campaign Central - resources, tips, information and networking for campaigners</title><description>Social networking, information, resources and inspiration for campaigners.</description><link>http://www.campaigncentral.org.uk/</link><dc:creator>mbinotto</dc:creator><dc:date>2013-10-10T12:46:30+02:00</dc:date><dc:subject>archivio campagne campaign information network non-profit resources tips </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Social networking, information, resources and inspiration for campaigners.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/archivio"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/campagne"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/campaign"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/non-profit"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/resources"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tips"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.eyeonearth.eu/"><title>Eye on Earth</title><description></description><link>http://www.eyeonearth.eu/</link><dc:creator>stair</dc:creator><dc:date>2013-01-09T13:24:44+01:00</dc:date><dc:subject>data environment eyeonearth information map mapping network </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2013-01-09T13:24:44+01:00&#034; href=&#034;http://www.eyeonearth.eu/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.eyeonearth.eu/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/environment"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/eyeonearth"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/map"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mapping"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.visualcomplexity.com/vc/"><title>visualcomplexity.com | A visual exploration on mapping complex networks</title><description></description><link>http://www.visualcomplexity.com/vc/</link><dc:creator>isidorfernandez</dc:creator><dc:date>2011-11-28T22:11:12+01:00</dc:date><dc:subject>design graphics information mapping maps network networks visualization </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-11-28T22:11:12+01:00&#034; href=&#034;http://www.visualcomplexity.com/vc/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.visualcomplexity.com/vc/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/design"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphics"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mapping"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/maps"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/visualization"/></rdf:Bag></taxo:topics></item><item rdf:about="http://radar.oreilly.com/2011/11/social-network-analysis.html"><title>Social network analysis isn&#039;t just for social networks - O&#039;Reilly Radar</title><description>Social network analysis (SNA) finds meaningful patterns in relationship data.</description><link>http://radar.oreilly.com/2011/11/social-network-analysis.html</link><dc:creator>maurices</dc:creator><dc:date>2011-11-16T13:09:07+01:00</dc:date><dc:subject>- 2.0 Dokumentation O&#039;Reilly Radar Social analysis der for information irhhu isn&#039;t just network networks social und web </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Social network analysis (SNA) finds meaningful patterns in relationship data.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/-"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2.0"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Dokumentation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/O&#039;Reilly"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Radar"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Social"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/der"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/for"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/irhhu"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/isn&#039;t"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/just"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/social"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/und"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/web"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.ecst.csuchico.edu/~beej/guide/net/html/"><title>Beej&#039;s Guide to Network Programming</title><description>Using Internet Sockets A tutorial on sockets programming.</description><link>http://www.ecst.csuchico.edu/~beej/guide/net/html/</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:35+02:00</dc:date><dc:subject>Programming Network Information </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Using Internet Sockets A tutorial on sockets programming.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.dslreports.com/"><title>broadband</title><description>The &#039;bible&#039; for Information on DSL, Cable and Other High Speed Internet Services</description><link>http://www.dslreports.com/</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:30+02:00</dc:date><dc:subject>Cable News Information Forum Network </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The &amp;#039;bible&amp;#039; for Information on DSL, Cable and Other High Speed Internet Services&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cable"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/News"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Forum"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.beepcore.org/"><title>BEEP</title><description>framework for building application protocols.</description><link>http://www.beepcore.org/</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:28+02:00</dc:date><dc:subject>Network Programming Information =Idea </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;framework for building application protocols.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=Idea"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.wisc.edu/~cao/papers/summary-cache/share.html"><title>A Scalable Wide-Area Web Cache Sharing Protocol</title><description>Li Fan, Pei Cao and Jussara Almeida &amp; Andrei Z. Broder - this new protocol, each proxy keeps a summary of the cache directory of each participating proxy, and checks these summaries for potential hits before sending any queries.</description><link>http://www.cs.wisc.edu/~cao/papers/summary-cache/share.html</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:27+02:00</dc:date><dc:subject>Network P2P BloomFilters&amp;DHT Algorithms Programming Paper(s) Information =O </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Li Fan, Pei Cao and Jussara Almeida &amp;amp; Andrei Z. Broder - this new protocol, each proxy keeps a summary of the cache directory of each participating proxy, and checks these summaries for potential hits before sending any queries.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/P2P"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/BloomFilters&amp;DHT"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Paper(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=O"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.rice.edu/~scrosby/hash/CrosbyWallach_UsenixSec2003/index.html"><title>Denial of Service via Algorithmic Complexity Attacks</title><description>Scott A. Crosby &amp; Dan S. Wallach Department of Computer Science, Rice University</description><link>http://www.cs.rice.edu/~scrosby/hash/CrosbyWallach_UsenixSec2003/index.html</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:25+02:00</dc:date><dc:subject>Network Algorithms Paper(s) Information =O </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Scott A. Crosby &amp;amp; Dan S. Wallach Department of Computer Science, Rice University&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Paper(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=O"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.site.uottawa.ca/~elsaddik/abedweb/applets/Applets/Sliding_Window/sliding_window.html"><title>Transmisson Control Protocol (TCP)</title><description>Protocol: Stop and Wait / Go-Back-n / Selective Repeat</description><link>http://www.site.uottawa.ca/~elsaddik/abedweb/applets/Applets/Sliding_Window/sliding_window.html</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:23+02:00</dc:date><dc:subject>Network Information =O </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Protocol: Stop and Wait / Go-Back-n / Selective Repeat&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=O"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.doxpara.com/"><title>Doxpara Research</title><description>a repository for information security analysis, UI theory, and the miscellaneous writings</description><link>http://www.doxpara.com/</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:22+02:00</dc:date><dc:subject>Network Security Algorithms Programming NAT Firewall Information =Idea </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;a repository for information security analysis, UI theory, and the miscellaneous writings&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Security"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/NAT"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Firewall"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=Idea"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.linuxvirtualserver.org/software/tcpsp/"><title>TCPSP - TCP Splicing</title><description>implements tcp splicing for the Linux kernel. The tcp splicing is a technique to splice two connections inside the kernel, so that data relaying between the two connections can be run at near router speeds.</description><link>http://www.linuxvirtualserver.org/software/tcpsp/</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:22+02:00</dc:date><dc:subject>Network Software Tool(s) Information GNU_Linux OpenSource =ToExamine </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;implements tcp splicing for the Linux kernel. The tcp splicing is a technique to splice two connections inside the kernel, so that data relaying between the two connections can be run at near router speeds.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Software"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Tool(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/GNU_Linux"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/OpenSource"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=ToExamine"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.omnifarious.org/~hopper/technical/tcp_splicing.html"><title>TCP splicing through simultaneous SYN exchange</title><description>originally a Slashdot post.</description><link>http://www.omnifarious.org/~hopper/technical/tcp_splicing.html</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:22+02:00</dc:date><dc:subject>Network NAT Information Article(s) =ToRead </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;originally a Slashdot post.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/NAT"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Article(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=ToRead"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.openp2p.com/pub/a/p2p/2003/03/13/howard.html"><title>The Next Revolution: Smart Mobs</title><description>by Richard Koman 03/13/2003 (peer-to-peer collective action)</description><link>http://www.openp2p.com/pub/a/p2p/2003/03/13/howard.html</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:22+02:00</dc:date><dc:subject>P2P Network Article(s) Information =O </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;by Richard Koman 03/13/2003 (peer-to-peer collective action)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/P2P"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Article(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=O"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www-136.ibm.com/developerworks/grid"><title>Grid computing @ IBM</title><description>Perspectives on grid</description><link>http://www-136.ibm.com/developerworks/grid</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:21+02:00</dc:date><dc:subject>Grid Network Information Paper(s) Article(s) =ToRead </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Perspectives on grid&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Grid"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Paper(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Article(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=ToRead"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.igda.org/online/#papers"><title>Online Games SIG (Special Interest Group)</title><description>The purpose of the Online Games White Papers is to provide online games market statistics, business model descriptions, technology summaries and publisher listings.</description><link>http://www.igda.org/online/#papers</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:21+02:00</dc:date><dc:subject>Network Game(s) Programming Paper(s) Information </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;The purpose of the Online Games White Papers is to provide online games market statistics, business model descriptions, technology summaries and publisher listings.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Game(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Paper(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mute-net.sourceforge.net/"><title>MUTE</title><description>a new peer-to-peer network that provides easy search-and-download functionality while also protecting your privacy.</description><link>http://mute-net.sourceforge.net/</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:20+02:00</dc:date><dc:subject>P2P Network MFC Programming OpenSource Paper(s) Information Cpp =ToExamine </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;a new peer-to-peer network that provides easy search-and-download functionality while also protecting your privacy.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/P2P"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MFC"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/OpenSource"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Paper(s)"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cpp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=ToExamine"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.hal-pc.org/~johnnie2/winsock.html"><title>Johnnie&#039;s Winsock Tutorial</title><description></description><link>http://www.hal-pc.org/~johnnie2/winsock.html</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:20+02:00</dc:date><dc:subject>Network MFC Programming Information Win32 Windows Cpp =O </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2011-10-01T02:27:20+02:00&#034; href=&#034;http://www.hal-pc.org/~johnnie2/winsock.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.hal-pc.org/~johnnie2/winsock.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/MFC"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Win32"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Windows"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Cpp"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=O"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.repairfaq.org/filipg/LINK/F_crc_v3.html"><title>A PAINLESS GUIDE TO CRC ERROR DETECTION ALGORITHMS</title><description>&#034;Everything you wanted to know about CRC algorithms, but were afraid to ask for fear that errors in your understanding might be detected.&#034;</description><link>http://www.repairfaq.org/filipg/LINK/F_crc_v3.html</link><dc:creator>panic</dc:creator><dc:date>2011-10-01T02:27:18+02:00</dc:date><dc:subject>Network Programming Algorithms Information =O </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;&amp;#034;Everything you wanted to know about CRC algorithms, but were afraid to ask for fear that errors in your understanding might be detected.&amp;#034;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Programming"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/Information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/=O"/></rdf:Bag></taxo:topics></item></rdf:RDF>